An Improved Bounding Box Algorithm to Collision Detection for Virtual Environment

The paper proposed a parallel collision detection algorithm based on bounding box-tree. The hierarchical bounding box –tree was built by dividing the polyhedron into tetrahedron. The collision detection can be completed by the method searching the bounding box-tree from top to bottom or from bottom to top. The first top-down search algorithm can give accurate calculation of collision detection, the second bottom-up search algorithms is suitable to the object which collides. The algorithm quickly eliminated the possibility of collision between objects far apart. The application of parallel method improves the collision speed for further step. And it well adapted to the needs of the dynamic collision detection. Test results showed that the algorithm greatly improved the collision detection’s speed in virtual environment.